Communication and Randomness Lower Bounds for Secure Computation
نویسندگان
چکیده
منابع مشابه
Lower bounds on communication for multiparty computation
The present report contains a proof of a linear lower bound for a typical three-party secure computation scheme of n independent AND functions. The goal is to prove some linear communication lower bound for a maximally broad definition of «typical». The article [1] contains various communications lower bounds for unconditionally secure multiparty computation. In particular, it contains a linear...
متن کاملRobust Randomness Amplifiers: Upper and Lower Bounds
A recent sequence of works, initially motivated by the study of the nonlocal properties of entanglement, demonstrate that a source of information-theoretically certified randomness can be constructed based only on two simple assumptions: the prior existence of a short random seed and the ability to ensure that two black-box devices do not communicate (i.e. are nonsignaling). We call protocols a...
متن کاملSecure Computation from Leaky Correlated Randomness
Correlated secret randomness is an essential resource for information-theoretic cryptography. In the context of secure two-party computation, the high level of efficiency achieved by informationtheoretic protocols has motivated a paradigm of starting with correlated randomness, specifically random oblivious transfer (OT) correlations. This correlated randomness can be generated and stored durin...
متن کاملLower Space Bounds for Randomized Computation
It is a fundamental open problem in the randomized computation how to separate diierent randomized time or randomized small space classes (cf., e.g., KV 87], KV 88]). In this paper we study lower space bounds for randomized computation, and prove lower space bounds up to log n for the speciic sets computed by the Monte Carlo Turing machines. This enables us for the rst time, to separate randomi...
متن کاملLower Bounds for Symbolic Computation on Graphs
A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to the standard RAM operations. We give lower bounds on the number of symbolic operations for basic graph problems such as the computation of the strongly conne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2016
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2568207